Serveur d'exploration sur l'OCR

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Optical recognition of handwritten Chinese characters by hierarchical radical matching method

Identifieur interne : 001C54 ( Main/Exploration ); précédent : 001C53; suivant : 001C55

Optical recognition of handwritten Chinese characters by hierarchical radical matching method

Auteurs : An-Bang Wang [République populaire de Chine] ; Kuo-Chin Fan [République populaire de Chine]

Source :

RBID : ISTEX:F56C0EB91A1089AD76635B08235F18333AE5E664

Abstract

In this paper, a radical-based OCR system for the recognition of handwritten Chinese characters is proposed. In our approach, a recursive hierarchical scheme is developed to perform radical extraction first. Character features and radical features are then extracted for matching. Last, a hierarchical radical matching scheme is devised to identify the radicals embedded in an input Chinese character and recognize the input character accordingly. Experiments for radical extraction are conducted on 1856 characters. The successful rate of radical extraction is 92.5%. The average time for radical extraction is 0.65 second per character. Experiments for matching process are conducted on two sets: training set and testing set, each set includes 900 characters. The overall recognition rate in our experiments is 98.2 and 80.9% (for training set and testing set, respectively). The average recognition time of our hierarchical radical matching scheme is 0.274s. There are totally 4716 radicals in 1800 characters. In average, one character consists of 2.62 radicals. Each character will match 7.28 radical templates in average. Thus, each radical will match 2.77 radical temples. The experimental results reveal that our proposed method is feasible, flexible, and effective.

Url:
DOI: 10.1016/S0031-3203(99)00207-1


Affiliations:


Links toward previous steps (curation, corpus...)


Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct">
<teiHeader>
<fileDesc>
<titleStmt>
<title>Optical recognition of handwritten Chinese characters by hierarchical radical matching method</title>
<author>
<name sortKey="Wang, An Bang" sort="Wang, An Bang" uniqKey="Wang A" first="An-Bang" last="Wang">An-Bang Wang</name>
</author>
<author>
<name sortKey="Fan, Kuo Chin" sort="Fan, Kuo Chin" uniqKey="Fan K" first="Kuo-Chin" last="Fan">Kuo-Chin Fan</name>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:F56C0EB91A1089AD76635B08235F18333AE5E664</idno>
<date when="2000" year="2000">2000</date>
<idno type="doi">10.1016/S0031-3203(99)00207-1</idno>
<idno type="url">https://api.istex.fr/document/F56C0EB91A1089AD76635B08235F18333AE5E664/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000581</idno>
<idno type="wicri:Area/Istex/Curation">000573</idno>
<idno type="wicri:Area/Istex/Checkpoint">001256</idno>
<idno type="wicri:doubleKey">0031-3203:2000:Wang A:optical:recognition:of</idno>
<idno type="wicri:Area/Main/Merge">001D53</idno>
<idno type="wicri:Area/Main/Curation">001C54</idno>
<idno type="wicri:Area/Main/Exploration">001C54</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a">Optical recognition of handwritten Chinese characters by hierarchical radical matching method</title>
<author>
<name sortKey="Wang, An Bang" sort="Wang, An Bang" uniqKey="Wang A" first="An-Bang" last="Wang">An-Bang Wang</name>
<affiliation wicri:level="1">
<country xml:lang="fr" wicri:curation="lc">République populaire de Chine</country>
<wicri:regionArea>Department of Banking and Insurance, Private Takming Junior College of Commerce, Taiwan</wicri:regionArea>
<wicri:noRegion>Taiwan</wicri:noRegion>
</affiliation>
</author>
<author>
<name sortKey="Fan, Kuo Chin" sort="Fan, Kuo Chin" uniqKey="Fan K" first="Kuo-Chin" last="Fan">Kuo-Chin Fan</name>
<affiliation wicri:level="1">
<country xml:lang="fr" wicri:curation="lc">République populaire de Chine</country>
<wicri:regionArea>Institute of Computer Science and Information Engineering, National Central University, Taiwan</wicri:regionArea>
<wicri:noRegion>Taiwan</wicri:noRegion>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="j">Pattern Recognition</title>
<title level="j" type="abbrev">PR</title>
<idno type="ISSN">0031-3203</idno>
<imprint>
<publisher>ELSEVIER</publisher>
<date type="published" when="1999">1999</date>
<biblScope unit="volume">34</biblScope>
<biblScope unit="issue">1</biblScope>
<biblScope unit="page" from="15">15</biblScope>
<biblScope unit="page" to="35">35</biblScope>
</imprint>
<idno type="ISSN">0031-3203</idno>
</series>
<idno type="istex">F56C0EB91A1089AD76635B08235F18333AE5E664</idno>
<idno type="DOI">10.1016/S0031-3203(99)00207-1</idno>
<idno type="PII">S0031-3203(99)00207-1</idno>
</biblStruct>
</sourceDesc>
<seriesStmt>
<idno type="ISSN">0031-3203</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass></textClass>
<langUsage>
<language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">In this paper, a radical-based OCR system for the recognition of handwritten Chinese characters is proposed. In our approach, a recursive hierarchical scheme is developed to perform radical extraction first. Character features and radical features are then extracted for matching. Last, a hierarchical radical matching scheme is devised to identify the radicals embedded in an input Chinese character and recognize the input character accordingly. Experiments for radical extraction are conducted on 1856 characters. The successful rate of radical extraction is 92.5%. The average time for radical extraction is 0.65 second per character. Experiments for matching process are conducted on two sets: training set and testing set, each set includes 900 characters. The overall recognition rate in our experiments is 98.2 and 80.9% (for training set and testing set, respectively). The average recognition time of our hierarchical radical matching scheme is 0.274s. There are totally 4716 radicals in 1800 characters. In average, one character consists of 2.62 radicals. Each character will match 7.28 radical templates in average. Thus, each radical will match 2.77 radical temples. The experimental results reveal that our proposed method is feasible, flexible, and effective.</div>
</front>
</TEI>
<affiliations>
<list>
<country>
<li>République populaire de Chine</li>
</country>
</list>
<tree>
<country name="République populaire de Chine">
<noRegion>
<name sortKey="Wang, An Bang" sort="Wang, An Bang" uniqKey="Wang A" first="An-Bang" last="Wang">An-Bang Wang</name>
</noRegion>
<name sortKey="Fan, Kuo Chin" sort="Fan, Kuo Chin" uniqKey="Fan K" first="Kuo-Chin" last="Fan">Kuo-Chin Fan</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001C54 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001C54 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Ticri/CIDE
   |area=    OcrV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:F56C0EB91A1089AD76635B08235F18333AE5E664
   |texte=   Optical recognition of handwritten Chinese characters by hierarchical radical matching method
}}

Wicri

This area was generated with Dilib version V0.6.32.
Data generation: Sat Nov 11 16:53:45 2017. Site generation: Mon Mar 11 23:15:16 2024